Long-range frustration in a spin-glass model of the vertex-cover problem.

نویسنده

  • Haijun Zhou
چکیده

In a spin-glass system on a random graph, some vertices have their spins changing among different configurations of a ground-state domain. Long-range frustrations may exist among these unfrozen vertices in the sense that certain combinations of spin values for these vertices may never appear in any configuration of this domain. We present a mean field theory to tackle such long-range frustrations and apply it to the NP-hard minimum vertex-cover (hard-core gas condensation) problem. Our analytical results on the ground-state energy density and on the fraction of frozen vertices are in good agreement with known numerical and mathematical results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Long range frustration in finite connectivity spin glasses: A mean field theory and its application to the random $K$-satisfiability problem

A mean field theory of long range frustration is constructed for spin glass systems with quenched randomness of vertex–vertex connections and of spin–spin coupling strengths. This theory is applied to a spin glass model of the random K-satisfiability problem (K = 2 or K = 3). The satisfiability transition in a random 2-SAT formula occurs when the clauses-to-variables ratio α approaches αc(2) = ...

متن کامل

Long Range Frustrations in a Spin Glass Model of the Vertex Cover Problem

In a spin glass system on a random graph, some vertices have their spins changing among different configurations of a ground–state domain. Long range frustrations may exist among these unfrozen vertices in the sense that certain combinations of spin values for these vertices may never appear in any configuration of this domain. We present a mean field theory to tackle such long range frustratio...

متن کامل

Long Range Frustration in Finite-Connectivity Spin Glasses: Application to the random K-satisfiability problem

A long range frustration index R is introduced to the finite connectivity Viana–Bray ±J spin glass model as a new order parameter. This order parameter is then applied to the random K-satisfiability (K-SAT) problem to understand its satisfiability transition and to evaluate its global minimum energy. Associated with a jump in R from zero to a finite value, SAT-UNSAT transition in random 3-SAT o...

متن کامل

THE EUROPEAN PHYSICAL JOURNAL B Vertex cover problem studied by cavity method: Analytics and population dynamics

We study the vertex cover problem on finite connectivity random graphs by zero-temperature cavity method. The minimum vertex cover corresponds to the ground state(s) of a proposed Ising spin model. When the connectivity c > e = 2.718282, there is no state for this system as the reweighting parameter y, which takes a similar role as the inverse temperature β in conventional statistical physics, ...

متن کامل

Maximum matching on random graphs

– The maximum matching problem on random graphs is studied analytically by the cavity method of statistical physics. When the average vertex degree c is larger than 2.7183, groups of max-matching patterns which differ greatly from each other gradually emerge. An analytical expression for the max-matching size is also obtained, which agrees well with computer simulations. Discussion is made on t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review letters

دوره 94 21  شماره 

صفحات  -

تاریخ انتشار 2005